A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique
نویسندگان
چکیده
The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.
منابع مشابه
A Formal Deenition of Bottom-up Embedded Push-down Automata and Their Tabulation Technique
The task of designing parsing algorithms for tree adjoining grammars could be simpliied by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent deeni-tion of this class of automata and, by removing the nite-sta...
متن کاملA redefinition of Embedded Push-Down Automata
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string.
متن کاملL-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory
We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of alphabets, the definition of orders over alphabet symbols, the partial definition of languages using unit tests, and the definition of mechanisms, which implement language generators or language recognizers. Supported mechanisms include predicates, regular expressions, fini...
متن کاملA Tabular Interpretation of a Class of 2-Stack Automata
I n t r o d u c t i o n 2-Stack automata [2SA] haw~' been identified as possible operational devices to describe parsing strategies for Linear Indexed Grammars [LIG] or Tree Adjoining Grammars [TAG] (mirroring the traditional use of Push-Down Automata [PDA] for ContextFree Grammars [CFG]). Different variants of 2SA (or not so distant EInbedded Push-Down Automata) have been proposed, some to des...
متن کاملThe effect of bottom-up and top-down auditory program training on the development of children's auditory processing skills
Although there have been several previous investigations on the role of auditory training for the development of auditory processing skills, it still remains unknown whether children with auditory processing difficulties can get improved auditory skills after exposure to a multi-modal training experience comprising both visual and tactile stimuli. The present study, therefore, attempted to use ...
متن کامل